Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
نویسندگان
چکیده
منابع مشابه
Parameterized Control Complexity in Bucklin Voting and in Fallback Voting1
We study the parameterized control complexity of Bucklin voting and of fallback voting, a voting system that combines Bucklin voting with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an election. We show that even though the representation of the votes and the winner determination is different, the parameterized complexity ...
متن کاملElection Attacks with Few Candidates
We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most of the generalized scoring rules, with respect to the number of candidates. Our results imply that all these strategic voting problems are fixed-parameter t...
متن کاملPrices Matter for the Parameterized Complexity of Shift Bribery
In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate p, and a budget. The goal is to ensure p’s victory by shifting p higher in some voters’ preference orders. However, each such shift request comes at a price (depending on the voter and on the extent of the shift) and we must not exceed the given budget. We study the parameterized computati...
متن کاملControl Complexity in Bucklin and Fallback Voting
Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. These actions modify an election’s participation structure and aim at either making a favorite candidate win (“constructive control”) or preventing a despised candidate from winning (“destructive control”). To protect elections from such control atte...
متن کاملHow Credible is the Prediction of a Party-Based Election?
In a party-based election, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the election can be predicted. However, in the actual election, the members of some “instable" parties often leave their own parties to join other parties. We introduce t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.05.019